4,115 research outputs found
Graph Theory and Networks in Biology
In this paper, we present a survey of the use of graph theoretical techniques
in Biology. In particular, we discuss recent work on identifying and modelling
the structure of bio-molecular networks, as well as the application of
centrality measures to interaction networks and research on the hierarchical
structure of such networks and network motifs. Work on the link between
structural network properties and dynamics is also described, with emphasis on
synchronization and disease propagation.Comment: 52 pages, 5 figures, Survey Pape
Diagonal Riccati Stability and Applications
We consider the question of diagonal Riccati stability for a pair of real
matrices A, B. A necessary and sufficient condition for diagonal Riccati
stability is derived and applications of this to two distinct cases are
presented. We also describe some motivations for this question arising in the
theory of generalised Lotka-Volterra systems
On Delay-independent Stability of a class of Nonlinear Positive Time-delay Systems
We present a condition for delay-independent stability of a class of
nonlinear positive systems. This result applies to systems that are not
necessarily monotone and extends recent work on cooperative nonlinear systems.Comment: 9 page
Global phase-locking in finite populations of phase-coupled oscillators
We present new necessary and sufficient conditions for the existence of fixed
points in a finite system of coupled phase oscillators on a complete graph. We
use these conditions to derive bounds on the critical coupling.Comment: 31 pages; to appear in SIAM journal of dynamical systems (SIADS
Extremal norms for positive linear inclusions
For finite-dimensional linear semigroups which leave a proper cone invariant
it is shown that irreducibility with respect to the cone implies the existence
of an extremal norm. In case the cone is simplicial a similar statement applies
to absolute norms. The semigroups under consideration may be generated by
discrete-time systems, continuous-time systems or continuous-time systems with
jumps. The existence of extremal norms is used to extend results on the
Lipschitz continuity of the joint spectral radius beyond the known case of
semigroups that are irreducible in the representation theory interpretation of
the word
On Lyapunov-Krasovskii Functionals for Switched Nonlinear Systems with Delay
We present a set of results concerning the existence of Lyapunov-Krasovskii
functionals for classes of nonlinear switched systems with time-delay. In
particular, we first present a result for positive systems that relaxes
conditions recently described in \cite{SunWang} for the existence of L-K
functionals. We also provide related conditions for positive coupled
differential-difference positive systems and for systems of neutral type that
are not necessarily positive. Finally, corresponding results for discrete-time
systems are described.Comment: 19 Page
Differential Privacy in Metric Spaces: Numerical, Categorical and Functional Data Under the One Roof
We study Differential Privacy in the abstract setting of Probability on
metric spaces. Numerical, categorical and functional data can be handled in a
uniform manner in this setting. We demonstrate how mechanisms based on data
sanitisation and those that rely on adding noise to query responses fit within
this framework. We prove that once the sanitisation is differentially private,
then so is the query response for any query. We show how to construct
sanitisations for high-dimensional databases using simple 1-dimensional
mechanisms. We also provide lower bounds on the expected error for
differentially private sanitisations in the general metric space setting.
Finally, we consider the question of sufficient sets for differential privacy
and show that for relaxed differential privacy, any algebra generating the
Borel -algebra is a sufficient set for relaxed differential privacy.Comment: 18 Page
The Markov chain tree theorem and the state reduction algorithm in commutative semirings
We extend the Markov chain tree theorem to general commutative semirings, and
we generalize the state reduction algorithm to commutative semifields. This
leads to a new universal algorithm, whose prototype is the state reduction
algorithm which computes the Markov chain tree vector of a stochastic matrix.Comment: 13 page
Issues in the design of switched linear systems : a benchmark study
In this paper we present a tutorial overview of some of the issues that arise in the design of switched linear control systems. Particular emphasis is given to issues relating to stability and control system realisation. A benchmark regulation problem is then presented. This problem is most naturally solved by means of a switched control design. The challenge to the community is to design a control system that meets the required performance specifications and permits the application of rigorous analysis techniques. A simple design solution is presented and the limitations of currently available analysis techniques are illustrated with reference to this example
Stability Criteria for SIS Epidemiological Models under Switching Policies
We study the spread of disease in an SIS model. The model considered is a
time-varying, switched model, in which the parameters of the SIS model are
subject to abrupt change. We show that the joint spectral radius can be used as
a threshold parameter for this model in the spirit of the basic reproduction
number for time-invariant models. We also present conditions for persistence
and the existence of periodic orbits for the switched model and results for a
stochastic switched model
- …